Computing Lower Expectations with Kuznetsov's Independence Condition
نویسنده
چکیده
Kuznetsov’s condition says that variables X and Y are independent when any product of bounded functions f X and g Y behaves in a certain way: the interval of expected values f X g Y must be equal to the interval product f X g Y . The main result of this paper shows how to compute lower expectations using Kuznetsov’s condition. We also generalize Kuznetsov’s condition to conditional expectation intervals, and study the relationship between Kuznetsov’s conditional condition and the semi-graphoid properties.
منابع مشابه
Computing Lower and Upper Expectations under Epistemic Independence
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic independence. New algorithms, based on multilinear programming, are presented, both for independence among events and among random variables. Separation properties of graphical models are also investigated.
متن کاملManipulation and the Causal Markov Condition
This paper explores the relationship between a manipulability conception of causation and the causal Markov condition (CM). We argue that violations of CM also violate widely shared expectations—implicit in the manipulability conception—having to do with the absence of spontaneous correlations. They also violate expectations concerning the connection between independence or dependence relations...
متن کاملKuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms
Kuznetsov independence of variables X and Y means that, for any pair of bounded functions f(X) and g(Y ), E [f(X)g(Y )] = E [f(X)] E [g(Y )], where E [·] denotes interval-valued expectation and denotes interval multiplication. We present properties of Kuznetsov independence for several variables, and connect it with other concepts of independence in the literature; in particular we show that st...
متن کاملThe Sharpness of Kuznetsov's O L 1 -error Estimate for Monotone Difference Schemes
We derive a lower error bound for monotone diierence schemes to the solution of the linear advection equation with BV initial data. A rigorous analysis shows that for any monotone diierence scheme the lower L 1 error bound is O ?p x , where x is the size of space step.
متن کاملConcentration Inequalities and Laws of Large Numbers under Irrelevance of Lower and Upper Expectations
for any bounded function f of Xi and any event A(X1:i−1) defined by variables X1:i−1. Here the functional E is an upper expectation (Section 2). A judgement of epistemic irrelevance can be interpreted as a relaxed judgement of stochastic independence, perhaps motivated by a robustness analysis or by disagreements amongst a set of decision makers. Alternatively, one might consider epistemic irre...
متن کامل